SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Rank (computer programming)</title>

</head>

Rank (computer programming)

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

In <a href="Computer_programming" title="Computer programming">computer programming</a>, rank with no further specifications is usually a synonym for (or refers to) "number of dimensions";<a href="#cite_note-1">[1]</a> thus, a two-dimensional array has rank two, a three-dimensional array has rank three and so on.

Strictly, no formal definition can be provided which applies to every <a href="Programming_language" title="Programming language">programming language</a>, since each of them has its own concepts, <a href="Formal_semantics_of_programming_languages" class="mw-redirect" title="Formal semantics of programming languages">semantics</a> and terminology; the term may not even be applicable or, to the contrary, applied with a very specific meaning in the context of a given language.

In the case of <a href="APL_programming_language" class="mw-redirect" title="APL programming language">APL</a> the notion applies to every operand; and <a href="Binary_function" title="Binary function">dyads</a> ("binary functions") have a left rank and a right rank.

The box below instead shows how rank of a type and rank of an array expression could be defined (in a semi-formal style) for C++ and illustrates a simple way to calculate them at compile time.

<div class="mw-highlight mw-highlight-lang-cpp mw-content-ltr" dir="ltr"><pre>#include <type_traits>

#include <cstddef>

/* Rank of a type

* -------------

*

* Let the rank of a type T be the number of its dimensions if

* it is an array; zero otherwise (which is the usual convention)

*/

template <typename T> struct rank

{

};

template<typename T, std::size_t N>

struct rank<T[N]>

{

static const std::size_t value = 1 + rank<T>::value;

};

template <typename T>

constexpr auto rank_v = rank<T>::value;

/* Rank of an expression

*

* Let the rank of an expression be the rank of its type

*/

template <typename T>

using unqualified_t = std::remove_cv_t<std::remove_reference_t<T>>;

template <typename T>

auto rankof(T&& expr)

{

return rank_v<unqualified_t<T>>;

}

</pre></div>

Given the code above the rank of a type T can be calculated at compile time by

<dl><dd><div class="mw-highlight mw-highlight-lang-cpp mw-content-ltr" dir="ltr"><pre>rank<T>::value

</pre></div></dd></dl>

or the shorter form

</pre></div></dd></dl>

Calculating the rank of an expression can be done using

<dl><dd><div class="mw-highlight mw-highlight-lang-cpp mw-content-ltr" dir="ltr"><pre>rankof(expr)

</pre></div></dd></dl>

<ul><li><a href="Rank_(linear_algebra)" title="Rank (linear algebra)">Rank (linear algebra)</a>, for a definition of rank as applied to <a href="Matrix_(mathematics)" title="Matrix (mathematics)">matrices</a></li>

<li><a href="Rank_(J_programming_language)" title="Rank (J programming language)">Rank (J programming language)</a>, a concept of the same name in the <a href="J_(programming_language)" title="J (programming language)">J programming language</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://files.schudio.com/federation-of-boldmere-schools/files/documents/Vocabulary_with_defintions.docx">"Vocabulary_with_defintions"</a>.</cite>

</li>

</ol></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .asbox{position:relative;overflow:hidden}.mw-parser-output .asbox table{background:transparent}.mw-parser-output .asbox p{margin:0}.mw-parser-output .asbox p+p{margin-top:0.25em}.mw-parser-output .asbox-body{font-style:italic}.mw-parser-output .asbox-note{font-size:smaller}.mw-parser-output .asbox .navbar{position:absolute;top:-0.75em;right:1em;display:none}.mw-parser-output :not(p):not(.asbox)+style+.asbox,.mw-parser-output :not(p):not(.asbox)+link+.asbox{margin-top:3em}

/* end https://en.wikipedia.org/ */

</style></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-02-05" href="https://en.wikipedia.org/wiki/?title=Rank_(computer_programming)&oldid=1274076977">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>